On Edge Addition Rewrite Systems and their Relevance to Program Analysis
نویسنده
چکیده
? Abstract. In this paper we deene a special class of graph rewrite systems for program analysis: edge addition rewrite systems (Ears). Ears can be applied to distributive data-ow frameworks over nite lattices Hec77] RSH94], as well as many other program analysis problems. We also present some techniques for optimized evaluation of Ears. They show that Ears are very well suited for generating eecient program analyzers.
منابع مشابه
How to Uniformly Specify Program Analysis and Transformation with Graph Rewrite Systems
Abs t r ac t . Implementing program optimizers is a task which swallows an enourmous amount of man-power. To reduce development time a simple and practial specification method is highly desirable. Such a method should comprise both program analysis and transformation. However, although several frameworks for program analysis exist, none of them can be used for analysis and transformation unifor...
متن کاملHRNCE Grammars - A Hypergraph Generating System with an eNCE Way
Software Integration Problems and Coupling of Graph Grammar Specifications p. 155 Using Attributed Flow Graph Parsing to Recognize Cliches in Programs p. 170 Reconfiguration Graph Grammar for Massively Parallel, Fault Tolerant Computers p. 185 The Use of Tree Transducers to Compute Translations Between Graph Algebras p. 196 The Bounded Degree Problem for Non-Obstructing eNCE Graph Grammars p. 2...
متن کاملPotential Benefits and Downsides of External Healthcare Performance Evaluation Systems: Real-Life Perspectives on Iranian Hospital Evaluation and Accreditation Program
Background Performance evaluation is essential to quality improvement in healthcare. The current study has identified the potential pros and cons of external healthcare evaluation programs, utilizing them subsequently to look into the merits of a similar case in a developing country. Methods A mixed method study employing both qualitative and quantitative data collection and analysis techniqu...
متن کاملOn the Verification of Logically Decorated Graph Transformations
We address the problem of reasoning on graph transformations featuring actions such as addition and deletion of nodes and edges, node merging and cloning, node or edge labelling and edge redirection. First, we introduce the considered graph rewrite systems which are parameterized by a given logic L. Formulas of L are used to label graph nodes and edges. In a second step, we tackle the problem o...
متن کاملMultivariate Amortised Resource Analysis for Term Rewrite Systems
We study amortised resource analysis in the context of term rewrite systems. We introduce a novel amortised analysis based on the potential method. The method is represented in an inference system akin to a type system and gives rise to polynomial bounds on the innermost runtime complexity of the analysed rewrite system. The crucial feature of the inference system is the admittance of multivari...
متن کامل